Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule

Automatic modelling to search distinguishers with high probability covering as many rounds possible, such MILP, SAT/SMT, CP models, has become a very popular cryptanalysis topic today. In those the optimizing objective is usually or number of distinguishers. If we want recover secret key for round-reduced block cipher, there are two phases, i.e., finding an efficient distinguisher and performing key-recovery attack by extending several before after distinguisher. The total attacked not only related chosen distinguisher, but also extended this paper, try combine phases in uniform automatic model.Concretely, apply idea automate related-key rectangle attacks on SKINNY ForkSkinny. We propose some new advantage perform attacks. Our few versions ForkSkinny cover 1 2 more than best previous